No Price Envy in the Multi-unit Object Allocation Problem with Non-quasi-linear Preferences
نویسندگان
چکیده
منابع مشابه
Strategy-proofness and efficiency with non-quasi-linear preferences: A characterization of minimum price Walrasian rule
We consider the problem of allocating objects to a group of agents and how much agents should pay. Each agent receives at most one object and has non-quasi-linear preferences. Non-quasi-linear preferences describe environments where payments influence agents’ abilities to utilize objects or derive benefits from them. The “minimum price Walrasian (MPW) rule” is the rule that assigns a minimum pr...
متن کاملThe Unit-Demand Envy-Free Pricing Problem
We consider the unit-demand envy-free pricing problem, which is a unit-demand auction where each bidder receives an item that maximizes his utility, and the goal is to maximize the auctioneer’s profit. This problem is NP-hard and unlikely to be in APX. We present four new MIP formulations for it and experimentally compare them to a previous one due to Shioda, Tunçel, and Myklebust. We describe ...
متن کاملNo profitable decompositions in quasi-linear allocation problems
We study the problem of allocating a bundle of perfectly divisible private goods from an axiomatic point of view, in situations where compensations can be made through monetary transfers. The key property we impose on the allocation rule requires that no agent should be able to gain by decomposing the problem into sequences of subproblems. Combined with additional standard properties, it leads ...
متن کاملEnvy-Free Pricing in Multi-unit Markets
We study the envy-free pricing problem in linear multi-unit markets with budgets, where there is a seller who brings multiple units of a good, while several buyers bring monetary endowments. Our goal is to compute an envy-free (item) price and allocation, i.e. an outcome where all the demands of the buyers are met given their budget constraints, which additionally achieves a desirable objective...
متن کاملSupplement to “ Strategy - proofness and efficiency with non - quasi - linear preferences : A characterization of minimum price Walrasian rule
Hall’s theorem (Hall 1935). Let N ≡ {1 n} and M ≡ {1 m}. For each i ∈N , let Di ⊆ M . Then there is a one-to-one mapping x′ from N to M such that for each i ∈ N , x′(i) ∈Di if and only if for each N ′ ⊆N , |i∈N ′ Di| ≥ |N ′|. Fact 4 (Mishra and Talman 2010). Let R ⊆ RE and R ∈ Rn. A price vector p is a Walrasian equilibrium price vector for R if and only if no set is overdemanded and no set is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4043344